Sandpiles, Spanning Trees, and Plane Duality
نویسندگان
چکیده
منابع مشابه
Sandpiles, Spanning Trees, and Plane Duality
Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associated to G whose order is equal to the number of spanning trees in G. Holroyd et al. used a dynamical process on graphs called rotor-routing to define a simply transitive action of the sandpile group of G on its set of spanning trees. Their definition depends on two pieces of auxiliary data: a choi...
متن کاملPacking Plane Spanning Trees and Paths in Complete Geometric Graphs
We consider the following question: How many edgedisjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane?
متن کاملPacking Short Plane Spanning Trees in Complete Geometric Graphs
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is very long (when compared to the minimum length needed to obtain a spanning graph). We consider two different approaches: first we show an almost optimal centra...
متن کاملPacking Plane Spanning Trees into a Point Set
Let P be a set of n points in the plane in general position. We show that at least bn/3c plane spanning trees can be packed into the complete geometric graph on P . This improves the previous best known lower bound Ω ( √ n). Towards our proof of this lower bound we show that the center of a set of points, in the d-dimensional space in general position, is of dimension either 0 or d.
متن کاملNetworks and Spanning Trees
In 1857 Arthur Cayley (1821–1895) published a paper [9] that introduces the term “tree” to describe the logical branching that occurs when iterating the fundamental process of (partial) differentiation. When discussing the composition of four symbols that involve derivatives, Cayley writes “But without a more convenient notation, it would be difficult to find [their] corresponding expressions ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2015
ISSN: 0895-4801,1095-7146
DOI: 10.1137/140982015